The Minimal Dominant Set is a Nonempty Core Extension

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The minimal dominant set is a non-empty core-extension

A TU-game in characteristic function form generates a unique minimal dominant set. This set is non-empty. For a game with a non-empty core, the core and the minimal dominant set coincide; in this case the core is the smallest (for inclusion) set of outcomes that satisfies accessibility. For an abstract game, the minimal dominant set and Shenoy’s dynamic solution coincide.

متن کامل

A Nonempty Extension of the Core

This paper gives a new characterisation of the dynamic solution of Shenoy for characteristic function games with myopic players. This solution is an extension to the core that is never empty. Our main result is the proof that for games with nonempty cores the core and the dynamic solution yield the same results.

متن کامل

Relaxed sequencing games have a nonempty core∗

We study sequencing situations with a fixed initial order and linear cost functions. In these sequencing situations cost savings can be obtained by rearranging jobs. When the jobs are owned by different players, next to the issue of finding an optimal order, the division of these cost savings forms an additional issue. Cooperative game theory studies this issue by taking into account that group...

متن کامل

2K2 vertex-set partition into nonempty parts

A graph is 2K2-partitionable if its vertex set can be partitioned into four nonempty parts A, B, C , D such that each vertex of A is adjacent to each vertex of B, and each vertex of C is adjacent to each vertex of D. Determining whether an arbitrary graph is 2K2-partitionable is the only vertex-set partition problem into four nonempty parts according to external constraints whose computational ...

متن کامل

Determination of the core of a minimal bacterial gene set.

The availability of a large number of complete genome sequences raises the question of how many genes are essential for cellular life. Trying to reconstruct the core of the protein-coding gene set for a hypothetical minimal bacterial cell, we have performed a computational comparative analysis of eight bacterial genomes. Six of the analyzed genomes are very small due to a dramatic genome size r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2002

ISSN: 1556-5068

DOI: 10.2139/ssrn.336160